Dynamic scheduling algorithm for parallel real-time graph tasks
نویسندگان
چکیده
منابع مشابه
Global Edf Scheduling for Parallel Real-time Tasks Contents
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic gr...
متن کاملReservation-Based Federated Scheduling for Parallel Real-Time Tasks
This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...
متن کاملA Real-Time Scheduling Algorithm for Soft Periodic Tasks
Since now, some scheduling algorithms have been presented to guarantee the time constraints of soft real-time tasks, but most of them have some drawbacks. The first drawback of them is that scheduling decisions are based on parameters which are assumed to be crisp; however, in many environments the values of these parameters are uncertain. The second one is the high time complexity of these met...
متن کاملReal-Time Scheduling of Linear Speedup Parallel Tasks
In this paper a problem of deterministic scheduling parallel applications in a multiprogrammed multiprocessor system is considered. We address the preemptive case. The number of processors used by a task can change over time. Any task can be executed with linear speedup on a number of processors not greater than some task-dependent constant. This problem can be solved by a low-order polynomial ...
متن کاملDynamic Scheduling of Real-Time Tasks on Multicore Architectures
We present a new dynamic scheduling on multicore architectures. This is an improvement of the Optimal Finish Time (OFT) scheduler introduced by Lemerre[7] reducing preemptions. Our result is compared with other schedulers and we show that our algorithm can handle with more general scheduling problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGBED Review
سال: 2012
ISSN: 1551-3688
DOI: 10.1145/2452537.2452541